Advanced OR and AI Methods in Transportation AN ATOMIC DIJKSTRA ALGORITHM FOR DYNAMIC SHORTEST PATHS IN TRAFFIC ASSIGNMENT
نویسندگان
چکیده
This paper presents an algorithm that solves the “single-source minimum-cost paths for all departure times” problem in the context of dynamic traffic assignment, when arc traversal times and costs are piecewise linear increasing functions of the time of arrival to an arc.
منابع مشابه
Literature Review of Traffic Assignment: Static and Dynamic
Rapid urban growth is resulting into increase in travel demand and private vehicle ownership in urban areas. In the present scenario the existing infrastructure has failed to match the demand that leads to traffic congestion, vehicular pollution and accidents. With traffic congestion augmentation on the road, delay of commuters has increased and reliability of road network has decreased. Four s...
متن کاملTraffic Network Optimal Scheduling Paths Based on Time Intervals Division
In order to make the network model was more fitting the actual condition of city traffic, this paper presents a dynamic transportation network model based on the traffic time division, and designs improved Dijkstra algorithm to solve the city traffic paths planning problem. Dijkstra algorithm is a typical singlesource shortest path algorithm is used to calculate a node to all other nodes in the...
متن کاملConversion of Network Problem with Transfer Nodes, and Condition of Supplying the Demand of any Sink from the Particular Source to the Transportation Problem
In this article we present an algorithm for converting a network problem with several sources and several sinks including several transfer nodes and condition of supplying the demand of any sink from a particular source to the transportation problem. Towards this end, and considering the very special structure of transportation algorithm, after implementing the shortest path algorithm or ...
متن کاملDifferent Network Performance Measures in a Multi-Objective Traffic Assignment Problem
Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...
متن کاملاستراتژیهای کوتاهترین مسیر در هدایت پویای وسیله نقلیه مبتنی بر معیار سطح سرویس- رویکرد الگوریتم ژنتیک ترکیبی
Dynamic route guidance system is an important section of intelligent transportation systems. The main core of this system is computation of shortest path based on the real-time information. In this research the formulation of dynamic guidance of vehicle has been presented based on characteristics of intelligent transportation systems and using the general level of service criteria which inclu...
متن کامل